Edge coloring models and reflection positivity Balázs Szegedy
نویسنده
چکیده
منابع مشابه
Edge-reflection positivity and weighted graph homomorphisms
B. Szegedy [Edge coloring models and reflection positivity, Journal of the American Mathematical Society 20 (2007) 969–988] showed that the number of homomorphisms into a weighted graph is equal to the partition function of a complex edge-coloring model. Using some results in geometric invariant theory, we characterize for which weighted graphs the edge-coloring model can be taken to be real va...
متن کاملEdge Coloring Models and Reflection Positivity
The motivation of this paper comes from statistical physics as well as from combinatorics and topology. The general setup in statistical mechanics can be outlined as follows. Let G be a graph and let C be a finite set of “states” or “colors”. We think of G as a crystal in which either the edges or the vertices are regarded as “sites” which can have states from C. In the first case we speak abou...
متن کاملThe rank of edge connection matrices and the dimension of algebras of invariant tensors
We characterize the rank of edge connection matrices of partition functions of real vertex models, as the dimension of the homogeneous components of the algebra of G-invariant tensors. Here G is the subgroup of the real orthogonal group that stabilizes the vertex model. This answers a question of Balázs Szegedy from 2007.
متن کاملLimits of dense graph sequences
We show that if a sequence of dense graphs Gn has the property that for every fixed graph F , the density of copies of F in Gn tends to a limit, then there is a natural “limit object”, namely a symmetric measurable function W : [0, 1] → [0, 1]. This limit object determines all the limits of subgraph densities. Conversely, every such function arises as a limit object. We also characterize graph ...
متن کاملLocally-Iterative Distributed (Delta + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models
We consider graph coloring and related problems in the distributed message-passing model. Locallyiterative algorithms are especially important in this setting. These are algorithms in which each vertex decides about its next color only as a function of the current colors in its 1-hop neighborhood. In STOC’93 Szegedy and Vishwanathan showed that any locally-iterative (∆ + 1)-coloring algorithm r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008